On Transferring Vdm Verification Techniques to Z on Transferring Vdm Veriication Techniques to Z

This paper discusses some of the necessary prerequisites for transferring speciication analysis and veriication techniques from VDM to Z. It starts by comparing Z and VDM in terms of the mathematical and speciication notations they use. It then explains the VDM approach to reasoning about speciications, as supported by the mural tool-set, and compares VDM's Logic of Partial Functions with Classical Logic. It outlines VDM proof obligations for checking consistency and completeness of speciications, and illustrates their use on a small example, comparing the results with a Z-like analysis. The paper concludes with a brief discussion of how the W logic for Z might be modiied for LPF.